Explicit Non-normal Modal Logic
نویسندگان
چکیده
Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of situations. To overcome this issue, we introduce novel justification logics as analogues to non-normal logics. We establish soundness completeness with respect various models study the problem realization.
منابع مشابه
Explicit Modal Logic
In 1933 Godel introduced a modal logic of provability (S4) and left open the problem of a formal provability semantics for this logic. Since then numerous attempts have been made to give an adequate provability semantics to Godel's provability logic with only partial success. In this paper we give the complete solution to this problem in the Logic of Proofs (LP). LP implements Godel's sugges...
متن کاملSemantical Analysis of Modal Logic Ii. Non-normal Modal Propositional Calculi
This paper continues the investigations of Kripke [63]. Not only is Kripke [63] presupposed; the reader is advised to have it on hand for ready reference. The notations and terminology of that paper are used freely; in particular, P, Q, R, ... are atomic formulae, and A, B, 0, ... are arbitrary formulae built from them using the connectives A, ~, O. All propositional calculi in this paper have ...
متن کاملNon-Denumerable Infinitary Modal Logic
Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...
متن کاملNormal Forms in Partial Modal Logic
A “partial” generalization of Fine’s definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi]. Introduction. From the viewpoint of formal linguistics, cognitive science and artificial intelligence, there appears to be a natural interest in the combinations of partiality and ...
متن کاملUnification in the normal modal logic Alt1
The unification problem in a logical system L can be defined in the following way: given a formula φ(x1, . . . , xα), determine whether there exists formulas ψ1, . . ., ψα such that φ(ψ1, . . . , ψα) is in L. The research on unification for modal logics was originally motivated by the admissibility problem for rules of inference: given a rule of inference φ1(x1, . . . , xα), . . . , φm(x1, . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88853-4_5